On Generalized Exponents of Tournaments
نویسندگان
چکیده
We determine two types of generalized exponent sets for tournaments with given order. In the course of proving the main results we find the following result, which may be interesting in its own right: When n is large enough, almost all tournaments on n vertices have the property that there is a path of length 2 from each vertex u to each vertex v 6= u.
منابع مشابه
Path - connect iv i ty in local tournaments 1
A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of x induce tournaments. We give characterizations of generalized arc-pancyclic and strongly path-panconnected local tournaments, respectively. Our results generalize those due to Bu and Zhang (1996) about arc-pancyclic local tournaments and about strongly arc-pancycl...
متن کاملON QUASILINEAR ELLIPTIC SYSTEMS INVOLVING MULTIPLE CRITICAL EXPONENTS
In this paper, we consider the existence of a non-trivial weaksolution to a quasilinear elliptic system involving critical Hardyexponents. The main issue of the paper is to understand thebehavior of these Palais-Smale sequences. Indeed, the principaldifficulty here is that there is an asymptotic competition betweenthe energy functional carried by the critical nonlinearities. Thenby the variatio...
متن کاملScaling in Tournaments
We study a stochastic process that mimics single-game elimination tournaments. In our model, the outcome of each match is stochastic: the weaker player wins with upset probability q ≤ 1/2, and the stronger player wins with probability 1−q. The loser is eliminated. Extremal statistics of the initial distribution of player strengths governs the tournament outcome. For a uniform initial distributi...
متن کاملPacking arc-disjoint triangles in regular and almost regular tournaments
For a tournament T , let ν3(T ) denote the maximum number of pairwise arc-disjoint triangles in T . Let ν3(n) denote the minimum of ν3(T ) ranging over all regular tournaments with n vertices (n odd). It is conjectured that ν3(n) = (1 + on(1))n /9 and proved that n 11.43 (1− on(1)) ≤ ν3(n) ≤ n 9 (1 + on(1)) improving upon the best known upper bound and lower bound. The result is generalized to ...
متن کاملA paired comparisons ranking and Swiss-system chess team tournaments
The paper reveals that the Weighted Logarithmic Least Squares Method used for deriving evaluations of alternatives from incomplete pairwise comparison matrices (iWLLSM) coincides with the recursive Buchholz ranking method applied in generalized tournaments, despite their different approach and calculation. We study it with respect to a set of new properties and present the strength of the metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002